Step of Proof: bool_cases
9,38
postcript
pdf
Inference at
*
1
1
I
of proof for Lemma
bool
cases
:
(tt = tt)
(tt = ff)
latex
by ((DNth 1 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
.
Definitions
,
t
T
,
P
Q
Lemmas
bfalse
wf
,
bool
wf
,
btrue
wf
origin